Exponential lower bounds for the numbers of Skolem-type sequences

نویسندگان

  • G. K. Bennett
  • Mike J. Grannell
  • Terry S. Griggs
چکیده

It was shown by Abrham that the number of pure Skolem sequences of order n, n ≡ 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both bounded below by 2bn/3c. These results are extended to give similar lower bounds for the numbers of hooked Skolem sequences, split Skolem sequences and split-hooked Skolem sequences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the number of additive permutations and Skolem-type sequences

Cavenagh and Wanless recently proved that, for sufficiently large odd n, the number of transversals in the Latin square formed from the addition table for integers modulo n is greater than (3.246). We adapt their proof to show that for sufficiently large t the number of additive permutations on [−t, t] is greater than (3.246) and we go on to derive some much improved lower bounds on the numbers...

متن کامل

Lower Bounds of Copson Type for Hausdorff Matrices on Weighted Sequence Spaces

Let = be a non-negative matrix. Denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers. If we used instead of The purpose of this paper is to establish a Hardy type formula for , where is Hausdorff matrix and A similar result is also established for where In particular, we apply o...

متن کامل

A note on the hardness of Skolem-type sequences

The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi Skolem sequences and generalized Skolem sequences are strongly NP-complete. These results are significant strengthenings and simplifications of th...

متن کامل

Capacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference

Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios‎. First, it is shown that the additive Gaussian ch...

متن کامل

Some inequalities involving lower bounds of operators on weighted sequence spaces by a matrix norm

Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ars Comb.

دوره 73  شماره 

صفحات  -

تاریخ انتشار 2004